Some characterizations of totally nonpositive (totally negative) matrices
نویسندگان
چکیده
منابع مشابه
Totally nonpositive completions on partial matrices ∗ †
An n × n real matrix is said to be totally nonpositive if every minor is nonpositive. In this paper, we are interested in totally nonpositive completion problems, that is, does a partial totally nonpositive matrix have a totally nonpositive matrix completion? This problem has, in general, a negative answer. Therefore, we analyze the question: for which labeled graphs G does every partial totall...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملSome Extremal Problems for Strictly Totally Positive Matrices
For a strictly totally positive M × N matrix A we show that the ratio IlAxllp/llxllp has exactly R = min{ M, N ) nonzero critical values for each fixed p ~ (1, ~ ) . Letting ~ denote the i th critical value, and x ~ an associated critical vector, we show that ~l > " " " > An > 0 and x i (unique up to multiplication by a constant) has exactly i 1 sign changes. These critical values are generaliz...
متن کاملTotally Nonnegative (0, 1)-Matrices
We investigate (0, 1)-matrices which are totally nonnegative and therefore which have all of their eigenvalues equal to nonnegative real numbers. Such matrices are characterized by four forbidden submatrices (of orders 2 and 3). We show that the maximum number of 0s in an irreducible (0, 1)-matrix of order n is (n − 1) and characterize those matrices with this number of 0s. We also show that th...
متن کاملImmanants of Totally Positive Matrices Are Nonnegative
If/ is an irreducible character of Sn, these functions are known as immanants; if/ is an irreducible character of some subgroup G of Sn (extended trivially to all of Sn by defining /(vv) = 0 for w$G), these are known as generalized matrix functions. Note that the determinant and permanent are obtained by choosing / to be the sign character and trivial character of Sn, respectively. We should po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2010
ISSN: 1081-3810
DOI: 10.13001/1081-3810.1371